Convergence rates of the DPG method with reduced test space degree
نویسندگان
چکیده
منابع مشابه
Convergence rates of the DPG method with reduced test space degree
Let us know how access to this document benefits you.
متن کاملConvergence Rates of the Pod-greedy Method
Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a-priori convergence rate statements for this algorithm have been given (Buffa et al 2009, Binev et al. 2010). The goal of the curre...
متن کاملDiscontinuous Petrov Galerkin Method (dpg) with Optimal Test Functions. a Finite Element Method for All Seasons?
ה ןויעה םוי 35 חשיא לש " מ 0 1 רבוטקואב 013 2 , ןב תטיסרבינוא ןוירוג , ראב עבש , לארשי
متن کاملDegree and wavenumber [in]dependence of Schwarz preconditioner for the DPG method
This note describes an implementation of a discontinuous Petrov Galerkin (DPG) method for acoustic waves within the framework of high order finite elements provided by the software package NGSolve. A technique to impose the impedance boundary condition weakly is indicated. Numerical results from this implementation show that a multiplicative Schwarz algorithm, with no coarse solve, provides a p...
متن کاملAn analysis of the practical DPG method
We give a complete error analysis of the Discontinuous Petrov Galerkin (DPG) method, accounting for all the approximations made in its practical implementation. Specifi cally, we consider the DPG method that uses a trial space consisting of polynomials of degree p on each mesh element. Earlier works showed that there is a "trial-to-test" operator T, which when applied to the trial space, defin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2014
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.08.004